Packing cycles in graphs, II
نویسندگان
چکیده
A graph G packs if for every induced subgraph H of G, the maximum number of vertexdisjoint cycles in H is equal to the minimum number of vertices whose deletion from H results in a forest. The purpose of this paper is to characterize all graphs that pack.
منابع مشابه
On Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملAlmost Resolvable Maximum Packings of Complete Graphs with 4-Cycles
If the complete graph Kn has vertex set X , a maximum packing of Kn with 4-cycles, (X,C, L), is an edge-disjoint decomposition of Kn into a collection C of 4-cycles so that the unused edges (the set L) is as small a set as possible. Maximum packings of Kn with 4-cycles were shown to exist by Schönheim and Bialostocki (Can. Math. Bull. 18:703–708, 1975). An almost parallel class of a maximum pac...
متن کاملHamilton decompositions of regular expanders: Applications
In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this theorem is that every regular tournament on n vertices can be decomposed into (n − 1)/2 edge-disjoint Hamilton cycles, whenever n is sufficiently large. This v...
متن کاملInduced packing of odd cycles in planar graphs
An induced packing of odd cycles in a graph is a packing such that there is no edge in the graph between any two odd cycles in the packing. We prove that the problem is solvable in time O(n ) when the input graph is planar. We also show that deciding if a graph has an induced packing of two odd cycles is NP-complete.
متن کاملLabeled packings of graphs
Graph packing generally considers unlabeled graphs. In this paper, we introduce a new variant of the graph packing problem, called the labeled packing of graphs. In particular, we present some results and conjectures about cycles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 87 شماره
صفحات -
تاریخ انتشار 2003